Search results for "Decision problem"
showing 10 items of 42 documents
An Application of Analytic Network Process in the Planning Process: The Case of an Urban Transformation in Palermo (Italy)
2014
The primary objective of this study is to test the multicriteria analysis application in favor of a selection process among alternative transformations of an urban area in the city of Palermo. The choice is referred to as a strategyoriented one aiming to create “new urban centralities” able to redraw all urban structures that start to activate renewal processes within the existing city. The application of multicriteria analysis technique, such as the Analytic Network Process (ANP) - BOCR model, is due to the need to represent the complexity of the decision problem characterized by interrelations among several elements described by many indicators from different levels. The case study is als…
A Paradigm Interpreting the City and the Analytic Network Process for the Management of Urban Transformations
2018
When urban and environmental transformations occur in areas where the equilibrium between nature and culture is complex and fragile, public ad-ministrations could decide to induce private investments using several tools, such as financial contributions to those projects of refurbishment that better re-spect the purpose of improving the environmental quality and of preserving the local architecture. Multicriteria models may support public decision process re-garding this issue, but it is essential to adopt a scientific paradigm that provides a major theoretical reference. This study proposes the development of a net-work model based on the scientific paradigm by Rizzo and the Analytic Net-wo…
Elements of Language Theory
1988
In this chapter we shall review the mathematical and computer science background on which the presentation in this book is based. We shall discuss the elements of discrete mathematics and formal language theory, emphasizing those issues that are of importance from the point of view of context-free parsing. We shall devote a considerable part of this chapter to matters such as random access machines and computational complexity. These will be relevant later when we derive efficient algorithms for parsing theoretic problems or prove lower bounds for the complexity of these problems. In this chapter we shall also discuss a general class of formal language descriptors called “rewriting systems”…
Approximations in Statistics from a Decision-Theoretical Viewpoint
1987
The approximation of the probability density p(.) of a random vector x∊X by another (possibly more convenient) probability density q(.) which belongs to a certain class Q is analyzed as a decision problem where the action space is the class Qof available approximations, the relevant uncertain event is the actual value of the vector x and the utility function is a proper scoring rule. The logarithmic divergence is shown to play a rather special role within this approach. The argument lies entirely within a Bayesian framework.
J-MADeM, a market-based model for complex decision problems
2010
This paper presents J-MADeM, a multi-modal decision making mechanism to provide agents in a Multi-Agent Systems (MAS) with a market-based model for complex decision problems. J-MADeM is now available as an open source library fully integrated into Jason, the successful interpreter for the AgentSpeak programming language. The aim of this work is to improve Jason by incorporating an agent decision-making module able to merge multiple information sources received from the rest of the agents. This information is modeled as a set of utility functions expressing the preferences of the agents for a specific problem. Then, J-MADeM agents use one-round sealed-bid combinatorial auctions as the main p…
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
2005
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
Quantum like modelling of decision making: quantifying uncertainty with the aid of the Heisenberg-Robertson inequality
2018
This paper contributes to quantum-like modeling of decision making (DM) under uncertainty through application of Heisenberg’s uncertainty principle (in the form of the Robertson inequality). In this paper we apply this instrument to quantify uncertainty in DM performed by quantum-like agents. As an example, we apply the Heisenberg uncertainty principle to the determination of mutual interrelation of uncertainties for “incompatible questions” used to be asked in political opinion pools. We also consider the problem of representation of decision problems, e.g., in the form of questions, by Hermitian operators, commuting and noncommuting, corresponding to compatible and incompatible questions …
V I G — A Visual and Dynamic Decision Support System for Multiple Objective Linear Programming
1989
In this paper we describe the principles of VIG (Visual Interactive Goal Programming), a Multiple Criteria Decision Support System, recently developed by Korhonen. PARETO RACE is a corner-stone of this system, which is designed to support both the modelling and solving of a multiple objective linear programming problem. The interface is based on one main menu, spreadsheets, and interactive use of computer graphics. VIG provides the decision-maker with the possibility to approach his/her decision problem by using an “evolutionary approach”. This means that the decision-maker does not have to specify the model precisely prior to solving the problem. In fact, the model evolves progressively. W…
Decision Support Systems Based on CLP Approach in SMEs
2006
The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (Constraint Logic Programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order execution in a manufacturer…